package com.test.ds.graph.dfs;

public class StackX {
	private final int SIZE = 20;
	private int[] st;
	private int top;
	
	public StackX(int s){
		st = new int[SIZE];
		top = -1;
	}
	
	public void push(char j){
		st[++top] = j;
	}
	
	public int pop(){
		return st[top--];
	}
	
	public int peek(){
		return st[top];
	}
	
	public boolean isEmpty(){
		return (top == -1);
	}
}
